Hierarchical data grouping in main-memory relational databases

ABSTRACT

Addressed herein is the problem of expressing and evaluating computations on hierarchies represented as database tables. Engine support for such computations is very limited today, and so they are usually outsourced into stored procedures or client code. Structural grouping is applied to relational algebra to provide concise syntax to express a class of useful computations. Algorithms are also provided to evaluate such structural groupings efficiently by exploiting available indexing schemes. Related apparatus, systems, techniques and articles are also described.

RELATED APPLICATION

The current application is a continuation of U.S. patent application Ser. No. 15/370,835 filed on Dec. 6, 2016 which, in turn claims priority to U.S. patent application Ser. No. 62/363,730 filed on Jul. 18, 2016 and entitled: “Index-Assisted Hierarchical Computations in Main Memory Relational Databases”, the contents of both of which are hereby fully incorporated by reference.

BACKGROUND

In business and scientific applications hierarchies appear in many scenarios: organizational or financial data, for example, is typically organized hierarchically, while the sciences routinely use hierarchies in taxonomies, say for animal species. In the underlying relational database management systems (RDBMS) they are represented in hierarchical tables using relational tree encodings. Looking at typical queries especially in analytic applications, it is noted that hierarchies serve mainly two purposes. The first is structural pattern matching, i.e., filtering and matching rows based on their positions in a hierarchy. The second is hierarchical computations: propagating measures and performing aggregation-like computations alongside the hierarchical dimension. To address both purposes on RDBMS level, two challenges need to be solved namely (1) how can a user express a task at hand intuitively and concisely in SQL (expressiveness)? and (2) how can the engine process these SQL queries efficiently (efficiency)?

Regarding pattern matching queries, both can be considered adequately solved, as they boil down to straightforward filters and structural joins on hierarchy axes such as “is-descendant”, and techniques for appropriate indexes and join operators are well-studied. The same cannot be said of hierarchical computations. For the purpose of computations, a subset of the hierarchy nodes is dynamically associated with values to be propagated or aggregated, and possibly filtered. In analytic applications, this has always been a routine task: Dimension hierarchies are typically modeled by denormalized leveled tables such as City-State-Country-Continent. Certain computations can then be expressed using SQL's basic grouping mechanisms (in particular ROLLUP). However, this is insufficient for computations beyond simple rollups, especially when the hierarchy is not organized into levels but exhibits an irregular structure—where nodes on a level may be of different typesand arbitrary depth. Consider the hierarchy in diagram 100 of FIG. 1. Suppose it is desired to compute weighted sums of some values attached to the leaves—how could one state a rollup formula incorporating the edge weights? This quickly turns exceedingly difficult in SQL. One tool that comes to mind are recursive common table expressions (RCTEs). However, more intricate aggregation-like computations tend to result in convoluted, inherently inefficient statements. Lacking RDBMS support, today users resort to stored procedures or client code as workarounds. These are unsatisfactory not only concerning expressiveness, they also ignore the known hierarchy structure and are thus handicapped in terms of efficiency.

SUMMARY

The current subject matter addresses issues of expressiveness and efficiency regarding complex computations on arbitrary irregular hierarchies by enhancing the RDBMS backend. The foundation of the current approach are the data model and SQL constructs which allow the user to conveniently define and query arbitrary hierarchies. This arrangement opens up new opportunities: the backend becomes aware of the hierarchy structure and can rely on powerful indexing schemes for query processing. Below are introduced concepts of hierarchical computations and corresponding SQL constructs, which can be translated into structural grouping operations in relational algebra. The efficient evaluation of structural grouping can requires index-assisted physical algebra operators.

In one aspect, a query is received by a database which comprises at least one request specifying a table whose rows can be related to a hierarchy of nodes. The query also specifies an aggregation operation for hierarchically aggregating the data in the specified table according to the hierarchy of nodes. Thereafter, the specified table that represents the data to be aggregated hierarchically is accessed. This table includes a plurality of tuples which each can be associated to at most one node of the hierarchy of nodes. Thereafter, it is checked, for a tuple, whether a hierarchy node associated to such tuple matches a node for a previous processed tuple; such previously processed tuple having a previously calculated aggregation value. Then, a previously calculated aggregation value is reused for a tuple if the node of such tuple matches the node for such previous processed tuple. An aggregation value is generated for each tuple when the aggregation value for such tuple cannot be reused from any previously processed tuple.

The aggregation values for the previously processed tuples can be placed within a stack and the generated aggregation values can also be placed into the stack. The hierarchy of nodes can include at least one root node and a plurality of leaf nodes and the hierarchy of nodes is traversed in a direction of the leaf nodes to the at least one root node.

The previously calculated aggregation values can be placed on top of the stack. Previously calculated aggregation values can be removed from the stack that are no longer needed when traversing the tuples.

In some variations, the hierarchy of nodes can be traversed in a direction from the root nodes to the leaf nodes. The stack, when viewed from its top, can include obsolete aggregation values which are dismissed and passed over.

Providing data can include one or more of: persisting at least a portion of the results, loading at least a portion of the results into memory, transmitting at least a portion of the results to a remote computing system, or displaying at least a portion of the results in an electronic visual display.

The query can be formulated in any of a variety of languages/protocols including Structured Query Language (SQL).

The database can take many forms including, without limitation, a main-memory relational database management system, a column-oriented in-memory database, and/or a distributed database in which data is stored across multiple computing systems.

Hierarchical windows for the query can be determined. Based on such hierarchical windows, input nodes and output nodes within such window can be determined using binary structural grouping. In other variations, recursive expressions on the hierarchical window can be evaluated using unary structural grouping.

Non-transitory computer program products (i.e., physically embodied computer program products) are also described that store instructions, which when executed by one or more data processors of one or more computing systems, cause at least one data processor to perform operations herein. Similarly, computer systems are also described that may include one or more data processors and memory coupled to the one or more data processors. The memory may temporarily or permanently store instructions that cause at least one processor to perform one or more of the operations described herein. In addition, methods can be implemented by one or more data processors either within a single computing system or distributed among two or more computing systems. Such computing systems can be connected and can exchange data and/or commands or other instructions or the like via one or more connections, including but not limited to a connection over a network (e.g., the Internet, a wireless wide area network, a local area network, a wide area network, a wired network, or the like), via a direct connection between one or more of the multiple computing systems, etc.

The subject matter provided herein provides many technical advantages. For example, the current subject matter provides techniques for querying hierarchical data that is more rapid than conventional techniques that also use fewer computational resources.

The details of one or more variations of the subject matter described herein are set forth in the accompanying drawings and the description below. Other features and advantages of the subject matter described herein will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram illustrating a sample table HT;

FIG. 2 is a diagram illustrating (a) input/output nodes nodes for binary grouping and (b) a combination of HT1 and inpl for unary grouping;

FIG. 3 is a diagram illustrating a bottom-up hierarchical window;

FIG. 4 is a diagram illustrating SQL examples for unary computations;

FIG. 5 is a diagram illustrating definitions of {circumflex over (Γ)}'s f(t,X);

FIG. 6 is a diagram illustrating experimental results; and

FIG. 7 is a process flow diagram illustrating execution of a database query on hierarchical data.

DETAILED DESCRIPTION

The current subject matter is directed to the querying of hierarchical data stored in a database such as, for example, a relational database management system (RDBMS) including, without limitation, a main-memory RDMBS and/or a column-oriented in-memory database such as the SAP HANA platform. As a starting point, hierarchical data can be represented in a relational table. More specifically, one can assume a table that encodes—using a suitable scheme—a forest of ordered, rooted, labeled trees, such that one table tuple (row) represents one hierarchy node. The labels of a node are the associated row's fields. For trees a 1:1 association between a node and its incoming edge can be made, so each field value can be interpreted as a label on either the node or edge. In the example table HT of FIG. 1, Weight is viewed as an edge label. The ordered property means that siblings have a defined order. It implies that every node has a well-defined rank in the pre- or post-order sequence of all nodes; e. g., B1 in the figure has pre rank 2 and post rank 3. While it can be appreciated that there are many options regarding the actual tree encoding to use, the current discussion of hierarchical computations is encoding-agnostic. The hierarchical table model conveniently hides the encoding details through an abstract data type NODE (the hierarchical table model is described in further detail in The current subject matter is related to the systems, methods, and computer program products described and illustrated in U.S. patent application Ser. No. 14/614,859 entitled “Hierarchy Modeling and Query” filed on Feb. 5, 2015, the contents of which are hereby fully incorporated by reference).

The Node attribute of HT identifies a row's position and is backed by a hierarchy index H, which encapsulates the forest structure. One can assume the index supports at the minimum two basic primitives, is-before-pre and is-before-post, in

(log |HT|) or even

. Given a pair (v₁, v₂) of node values, they test whether v₁ precedes v₂ with respect to pre- and post-order traversal of the hierarchy. This allows one to test pairs of nodes against the main hierarchy axes:

-   -   preceding: is-before-pre(v₁, v₂) {circumflex over         ( )}is-before-post(v₁, v₂)     -   descendant: is-before-pre(v₂, v₁) {circumflex over         ( )}is-before-post(v₁, v₂)     -   following: is-before-pre(v₂, v₁) {circumflex over         ( )}is-before-post(v₂, v₁)     -   ancestor: is-before-pre(v₁, v₂) {circumflex over         ( )}is-before-post(v₂, v₁)     -   self: v₁=v₂

In HT, C3 follows B/C1/C2 and precedes A2/C4/D3.The ancestor/descendant and preceding/following axes are symmetric. In pseudo code, one can denote e.g. “H. is-descendant(v₁, v₂)” for an axis check “v₁ is a descendant of v₂”, and sometimes use “-or-self” variants with the obvious meaning. Specific index implementations will natively support these and other axes as well as further primitives (e. g. is-child, level), but the current algorithms rely only on is-before-pre/post. An example implementation is the simple PPPL labeling scheme. Here, Node is a 4-tuple storing the pre/post ranks, the parent's pre rank, and the level of the node. Additionally, the hierarchy table is indexed on the pre/post ranks using two simple lookup tables. With PPPL, the index primitives obviously boil down to very cheap

(1) arithmetics on

Node, so this is as fast as a hierarchy index can get. If some degree of update support is needed, however, a more sophisticated indexing scheme must be chosen. Note again that, while one can rely on the NODE abstraction for ease of presentation, the concepts and algorithms herein can be adapted to any specific “hard-coded” encoding that affords the said primitives.

A hierarchical computation propagates and accumulates datausually numeric values—along the hierarchy edges. Data flow can happen either in the direction towards the root (bottom up) or away from the root (top down, matching the natural direction of the edges). Unlike the “static” labels stored with the base table itself (e. g., ID and Weight in HT), the computation input is generally the result of an arbitrary subquery that associates some hierarchy nodes with input values, such as table Inpl of FIG. 2A.

In an analytic scenario, HT may be a so-called dimension hierarchy arranging products (leaves) into products groups (inner nodes), and a fact table Sales may associate each sale item with a specific product, i.e., a leaf of HT:

-   -   Sales: {[Sale, Item, Customer, Product, Date, Amount]}

Here, the computation input would be the amounts from Sales, attached to some of the product leaves via join. A canonical task in such scenarios known as rollup is to sum up the revenue of certain products—say, “type A”—along the hierarchy bottom up and report these sums for certain product groups visible in the user interfacesay, the three uppermost levels. The following SQL statement I-a computes the rollup, using the IS_DESCENDANT_OR_SELF and LEVEL constructs (as described in U.S. patent application Ser. No. 14/614,859):

WITH Inp1 AS ( I-a  SELECT p.Node, s.Amount AS Value  FROM HT p JOIN Sales s ON p.Node = s.Product WHERE p.Type = ‘type A’ ) SELECT t.*, SUM(u.Amount) AS Total FROM HT t LEFT OUTER JOIN Inp1 u ON IS_DESCENDANT_OR_SELF(u.Node, t.Node)  WHERE LEVEL(t.Node) <= 3  GROUP BY t.*

This represents a type of hierarchical computations with two particular characteristics: First, only a subset of nodes carry an input value—often only the leaves, as in the example; one can call these input nodes. Second, the set of input nodes is mostly disjunct from the output nodes that after the computation carry a result one can be interested in. Input and output nodes are therefore determined by separate subqueries and the queries follow a join-group-aggregate pattern. This scheme can be referred to as binary structural grouping. “Structural” here alludes to the role the hierarchy structure plays in forming groups of tuples. The query plans are typically variations of Γ

(e₁[t]

_(μ<t)e₂[u]). Here

denotes the standard left outer join operation.

denotes unary grouping, which in this case groups its input tuples by t.*, applies function f to each group, and attaches an attribute x carrying the resulting aggregate value to each group. < reflects the input/output relationship among tuples. Suppose one wanted to compute a rollup based on the example input Inpl, and one is interested in three output nodes given by Out1in FIG. 2A. To do so, one can use e₁=Out1,e₂=Inp1, and define the < predicate as H.is-descendant-or-self (u.Node, t.Node) and f(X) as Σ_(μϵx) ^(μ)Value. This yields the sums 6310, 310, and 100 for A1, B1, and C1, respectively.

Such query plans perform acceptably when f is cheap to compute and the set of output nodes is rather small. However, there is a major efficiency issue: for each ei tuple, the computation fbluntly sums up all matching input values from e₂, while ideally one can reuse results from previously processed e₁ tuples. In the example, to compute the sum for A1 one can save some arithmetic operations by reusing the sum of B1 and adding just the input values of D1/D2/D3. With respect to <, one can say that the output node B1 is covered by the output node A1 and thus carries a reusable result. To enable such reuse, the binary grouping algorithms provided herein process the e₁ tuples in < order and memorize any results that may be relevant for upcoming e₁ tuples. Thereby they overcome the mentioned inefficiencies.

From an expressiveness point of view, the widespread join-group-aggregate statements are fairly intuitive to most SQL users, yet not fully satisfactory: they lack conciseness, since conceptually a table of < pairs must be assembled by hand prior to grouping, and the fact that a top-down or bottom-up hierarchical computation is being done is somewhat disguised. They become tedious especially when the output and input nodes largely overlap or are even identical, as in

SELECT t.Node, SUM(u.Value) II-a FROM Inp1 AS t LEFT OUTER JOIN Inp1 AS u  ON IS_DESCENDANT_OR_SELF(u.Node, t.Node)  GROUP BY t.*

The proposed extensions to SQL's windowed table provided herein allow one to equivalently write:

SELECT Node, SUM(Value) OVER (HIERARCHIZE BY Node) II-b  FROM Inp1

One can refer to this scheme as unary structural grouping, since the computation now works on a single table. It inherently yields a result for every tuple, i.e., every node acts as both an input and output node. A binary grouping query can usually be rewritten to unary grouping by working on the merged “e₁∪e₂” table and filtering the output nodes a posteriori. For example, Inp2 in FIG. 2b shows a combination of HT and Inp1; here NULL is assigned as a neutral value to nodes which do not carry a meaningful value. Rewriting binary to unary computations will often result in more concise and intuitive statements. Especially when there is no clear distinction between input and output nodes, unary grouping is the most natural approach.

The unary structural grouping mechanism offers another attractive language opportunity: support for structural recursion. Using a structurally recursive expression one can state the rollup in Stmt. II-a and II-b in yet another way:

SELECT Node, RECURSIVE INT (Value + SUM(x) OVER w) II-c AS x  FROM Inp1 WINDOW w AS (HIERARCHIZE BY Node)

This expression for x sums up the readily computed sums x of all tuples that are covered by the current tuple. Unlike binary grouping, unary grouping with structural recursion makes the reuse of previous results explicit and thus inherently translates into the efficient evaluation approach. Furthermore, it enables one to state significantly more complex computations with remarkable conciseness. For example, one can now straightforwardly take the edge weights from Inp2 into account in the rollup:

SELECT Node, RECURSIVE DOUBLE ( III Value + SUM(Weight * x) OVER w) AS x  FROM Inp2 WINDOW w AS (HIERARCHIZE BY Node)

Rather than actually performing recursion, the current operators evaluate unary grouping in a bottom-up fashion, leveraging a <-sorted input table like their binary counterparts.

As described below, various computations can be expressed in SQL. Unlike binary grouping, unary structural grouping is a novel concept to SQL. Provided below are details regarding various new syntax and semantics of extensions for unary grouping.

Windowed tables are a convenient and powerful means for aggregations and statistical computations on a single table, which otherwise would require unwieldy correlated subqueries. Their implicitly self-joining nature makes them a natural fit for structural grouping. One can therefore extend this mechanism by hierarchical windows.

A standard window specification may comprise a window partition clause, a window ordering clause, and a window frame clause. Consider how one may annotate the Sales table from with per-customer sales totals running over time:

SELECT Customer, Date, SUM(Amount) OVER w  FROM Sales WINDOW w AS ( PARTITION BY Customer ORDER BY Date RANGE BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW EXCLUDE NO OTHERS )

The frame clause “RANGE . . . NO OTHERS” is the implicit default and could be omitted. Briefly put, the query is conceptually evaluated as follows: (1) the Sales are partitioned by Customer; (2) each partition is sorted by Date; (3) within each sorted partition, each tuple t is associated with a group of tuples relative to t, its window frame as determined by the frame clause, in this case: all sales up to t; (4) the window function (SUM) is evaluated for that group and its result appended to t. The frame is always a subsequence of the current ordered partition. Note that tuples need not be distinct with respect to the ORDER BY fields. Tuples in is frame that match in these fields are called peers or TIES.

For unary structural grouping, the windowed table will be some collection of nodes (e. g. Inp1); that is, there is a NODE field whose values are drawn from a hierarchical base table (e. g. HT). One can extend the standard window specification with a new HIERARCHIZE BY clause specifying a hierarchical window. This clause may take the place of the ordering clause behind the partitioning clause. That is, partitioning happens first as usual, and hierarchizing replaces ordering. While window ordering turns the partition into a partially ordered sequence, hierarchizing turns it into an directed acyclic graph derived from the hierarchy. One can begin the discussion with a minimal hierarchical window specification, which omits partitioning and the frame clause (so the above default applies):

-   -   HIERARCHIZE BY ν BOTTOM UP|TOP DOWN

The clause determines the NODE field v, its underlying hierarchy index H, and the direction of the intended data flow (bottom up by default), giving one all information needed to define an appropriate<predicate on the partition:

-   -   top-down: μ<t:⇔H.is-descendant(t,v,u,v)     -   bottom-up: μ<t:⇔H.is-descendant(u,v,t,v)

The notion of covered elements used informally above is also needed. An element u is said to be covered by another element t if no third element lies between them:

μ<:t:⇔μ<t{circumflex over ( )}

∃μ′:μ<μ′t  Eq. 1

Using <: one can identify the immediate < neighbors (descendants/ancestors) of a tuple t within the current partition. Note that in case all hierarchy nodes are contained in the current partition, the “tuple u is covered by t” relationship is equivalent to “node u.v is a child/parent of t.v”. However, the general <: notion is needed because the current partition may well contain only a subset of the nodes. The <: predicate helps one establish a data flow between tuples even when intermediate nodes are missing in the input.

A tuple u from the current partition can be related in four relevant ways to the current tuple t:

-   -   (a) μ<t (b)t<u (c)u.v=t.v (d) neither of those

To reuse the syntax of the standard window frame clause without any modifications, one may need to reinterpret three concepts accordingly: PRECEDING tuples are those of category (a); FOLLOWING tuples are those of category (b); TIES are tuples of category (c). In the bottom-up case, PRECEDING tuples correspond to descendants and FOLLOWING tuples to ancestors of t.v. These terms are not to be mixed up with the preceding and following hierarchy axes. Tuples on those axes, as well as tuples where v is NULL, fall into category (d) and are always excluded from the frame. The default frame clause includes categories (a), (c), and the current row itself. The handling of (c) tuples can be controlled independently via the EXCLUDE clause.

Consider FIG. 3, where one can apply a bottom-up hierarchical window to table Inp3 and compute x=SUM(Value) like in Stmt. II-b from above (and reproduced here:

SELECT Node, SUM(Value) OVER (HIERARCHIZE BY Node) II-b  FROM Inp1)

The matrix indicates the relationships of the tuples. Since the current window uses the default frame clause, the frames comprise exactly the <, <, and

tuples. Summing over them yields the x values shown to the right. Note that although Inp3 does not include the intermediate nodes B1/C3/C4, the input values of C1/C2 do still count into A1, and likewise for D1/D3 and the B2 tuple, as illustrated by the data flow graph to the right. As said, unary grouping does not require all intermediate nodes to be present in the input. In that, it behaves precisely like the alternative binary approach based on an IS_DESCENDANT_OR_SELF_join (Stmt. II-a). For basic rollups, which are by far the most common type of hierarchical computation, the implicit window frame clause does exactly the “right thing”—thanks to the definitions of < and the PRECEDING/FOLLOWING conceptsand it is hard to imagine a more concise and readable way of expressing them in SQL.

Recursive Expressions. Thus far, hierarchical windows are merely a shorthand; they can equivalently be expressed through joingroupaggregate statements. Structural recursion, however, significantly extends their expressive power. To enable recursive expressions, one can recycle the SQL keyword RECURSIVE and allow wrapping it around expressions containing one or more window functions:

-   -   RECURSIVE [τ](expr)AS c

This makes a field τ of type accessible within any contained window function, and thus provides a way to refer to the computed expr value of any tuple in the window frame. If c is used anywhere in expr, τ must be specified explicitly, and an implicit CAST to τ is applied to expr. Automatic type deduction in certain cases is a possible future extension, but it is not generally possible without ambiguity. The following additional rules apply: First, if expr contains one or more window function expressions of the form “expr_(i) OVER w_(i)”, all used hierarchical windows wi must be equal (same partitioning and HIERARCHIZE clause, i.e., NODE field and direction). Second, the frame of each window wi is restricted as follows: only the covered tuples (“RANGE 1 PRECEDING”) can potentially be included in the frame, and in particular EXCLUDE GROUP is enforced. That is, the frame clause of every window function within expr effectively becomes:

-   -   RANGE BETWEEN 1 PRECEDING AO CURRENT ROW EXCLUDE CROUP

This in particular ensures that the window frame will not contain the CURRENT ROW, any TIES, or any FOLLOWING tuples. If any of those were contained in the frame, any access to field c within expr would create a circular dependency. Third, the field c may appear only within one of the window function expressions expr_(i); say, in combination with an aggregate function AGG:

-   -   RECURSIVE τ AGG(expr′) OVER w . . . ) AS c

Mentioning c outside a window function would implicitly access the current tuple, which is forbidden, whereas according to SQL's rules mentioning c within expr′ implicitly accesses the frame row (FRAME_ROW), which thanks to the restrictive window frame can only be a covered tuple for which the c value is available. While this standard behavior is what is usually intended and quite convenient, SQL has a way to override the implicit frame row access. One could for example refer to the current tuple even within AGG by using a so-called nested window function:

-   -   AGG(. . . VALUE_OF (c AT CURRENT_ROW) . . .) OVER w

This is prohibited for c, but it is allowed any other field.

Returning to diagram 300 of FIG. 3, one can now equivalently apply the recursive rollup expression of Stmt. II-c, x=RECURSIVE INT (Value+SUM(x) OVER w) AS x, to Inp3. The window frames are now restricted to the covered <: tuples. Since Inp3 is already ordered suitably for bottom-up evaluation—i.e. postorder—one can fill in the x result column in a single pass and always have the x values of the frame rows at hand.

Even with non-recursive expressions, hierarchical windows are already an attractive alternative to verbose joingroupaggregate statements. Consider the opening query I-a from above (and reproduced below).

WITH Inp1 AS ( I-a  SELECT p.Node, s.Amount AS Value  FROM HT p JOIN Sales s ON p.Node = s.Product WHERE p.Type = ‘type A’ ) SELECT t.*, SUM(u.Amount) AS Total FROM HT t LEFT OUTER JOIN Inp1 u ON IS_DESCENDANT_OR_SELF(u.Node, t.Node)  WHERE LEVEL(t.Node) <= 3  GROUP BY t.*

SQL allows aggregation to be restricted by a FILTER. This handy feature allows one to state this query as follows:

SELECT * FROM ( I-b  SELECT HT.*,  SUM(Amount) FILTER (WHERE Type = ‘type A’) OVER w FROM HT LEFT OUTER JOIN Sales s ON Node = s.Product  WINDOW w AS (HIERARCHIZE BY Node) ) WHERE LEVEL(Node) <= 3

This saves one join over Stmt. I-a. Note the outer join may yield tuples where Amount is NULL, but these are conveniently ignored by SUM. Altogether there are three points where one could add WHERE conditions: a priori (before windows are formed), as FILTER (restricting the computation input but not affecting the table), and a posteriori (restricting the output). For the latter one must nest two selections, as SQL currently has no HAVING equivalent for windowed tables.

FIG. 4 shows further meaningful expressions, including non-recursive variants where possible, each based on either a bottom-up or a top-down hierarchical window on Inp2:

SELECT Node, expr FROM Inp2 IV WINDOW td AS (HIERARCHIZE BY Node TOP DOWN),  bu AS (HIERARCHIZE BY Node BOTTOM UP)

(1) in FIG. 4 is the familiar rollup. Besides SUM, the operation in (1 a) of FIG. 1 could e.g. be AVG, MIN, MAX, COUNT (cf. Ex. 7), EVERY, ANY, or ARRAY_AGG to simply collect all values in an array. SQL's DISTINCT and FILTER constructs add further expressiveness. E.g., in a bill of materials one may count the distinct types of subparts of a certain manufacturer that each part is built of:

-   -   COUNT (DISTINCT Type) FILTER (WHERE Manufacturer=‘A’) OVER bu

(2) in FIG. 4 is a top-down counterpart to (1); it yields the effective weights by multiplying over all tuples on the root path. (2a) uses a hypothetical PRODUCT aggregation function, which is curiously missing from standard SQL; (2b) works around that via recursion, aptly taking advantage of FIRST_VALUE. To understand the example, note that for a top-down recursive computation, the window frame can be either empty—making FIRST_VALUE yield NULL—or contain one covered ancestor. In the bill of materials the weight could be the part's multiplicity (“how often?”) within its super-part; here the product would tell that the part often appears in total in the assembly.

(3) is a variant of (1) summing over only the covered tuples. In (3b) one can access only Value but not the actual expression result (thus, its type τ can be auto-deduced); still, the semantics are those of recursive evaluation. As Inp2 happens to contain all HT nodes, the cover relation <: becomes equivalent to the IS_CHILD predicate as noted earlier; so the same could as well be achieved via join-group-aggregate.

(4) are variants of weighted rollup. (4d) is mostly equivalent to (4b), but brings it into a form similar to (4c) using a nested window function to access the Weight of the current row. In general, such weighted rollups cannot be performed without (structural) recursion. However, a non-recursive workaround that sometimes works is to “multiply out” the expression according to the distributivity law and use two separate computations: First (2a), yielding absolute weights w for each tuple, then SUM(w*Value) bottom up.

(5) constructs a path-based Dewey representation of the hierarchy using the same technique as (2): it builds a string from the ID values on the root path, e. g. ′/A1/B1/C1′ for C1.

(6-9) compute properties of the data flow graph over the input table. As Inp2 contains all nodes of HT, they are equal to the node's (6) level, (7) subtree size, (8) subtree height, and (9) child count. In general (7) gives the size of the window frame and (9) the number of covered tuples.

Finally (10), if one needs to go beyond the capabilities of SQL's aggregate functions and expression language, one can use ARRAY AGG to collect data from the covered tuples and pass it to a user-defined function. This way arbitrarily complex computations can be plugged in.

Structural Grouping Operators. Provided herein are two logical operators for evaluating hierarchical computation queries, one for unary and one for binary structural grouping.

Binary Grouping. Binary structural grouping queries typically feature an inner or left outer join on a hierarchy axis such as IS DESCENDANT, and subsequent grouping of the outer side. They are initially translated into plans of the form σ(Z-,39 ) with a suitable hierarchy predicate θ. Due to the efficiency issues noted above, the query optimizer to rewrite this pattern into a single combined operator.

The binary grouping operator

consumes two input relations {τ₁}_(b) and {τ₂}_(b) given by expressions e₁ and e₂, where { }_(b) denotes a bag and Ind T′a _(are tuple types). _(Let 6 be a join predicate, x a new attribute name, and fa) scalar aggregation function {τ₂}_(b)→

for some type

. Then

is defined as

e₁

_(a) ^(θ):fe₂:={to[x:f(e₂{o^(t)]|tϵe₁}_(b),

where e[_(θ) ^(t)]:={μ|μϵe{circumflex over ( )}θ(μ,t)}_(b). It extends each tuple t ϵ_(e1) by an x attribute of

, whose value is obtained by applying function f to the bage[θt], which contains the relevant input for tuples t.

As an example, the plan Γ_(t8jx:f)(Out1[t]

_(μ<t)Inp1[μ]) from above can be rewritten into Out1:

Inp1, using the same definitions of f and <.

Beyond optimizing64 (

_(θ)) plans, one can also use

to evaluate hierarchical windows with non-RECURSIVE expressions. They are translated into binary self-grouping grouping e

_(x) ^(θ):f e, with θ=is-descendant-or-self in the bottom-up and θ=is-ancestor-or-self in the top-down case (modulo handling details of the frame clause and EXCLUDE). Further optimizations are possible from there. Consider Stmt. I-b, which has a condition H.level(v)≤3 on the output that does not depend on the computed sum x. Select operators σ_(ϕ)of this kind can typically be pushed down to the left input of

. The FILTER Ψ can be handled by f or pushed down to the right input. Such rewriting from σ_(ϕ)(e

_(x) ⁰:f_(Ψ) ^(e)) to σ₉₉(e)

_(x) ^(θ):fσΨ(e) will always pay off, especially when the selections can be pushed down even further.

Unary Structural Grouping. To evaluate recursive expressions on a hierarchical window, a new operator is provided herein: unary structural grouping. Since the concept as such may be useful beyond hierarchical windows, one may define it in terms of an abstract <comparison predicate on the tuples of its input relation, which drives the data flow. It is required to be a strict partial order: irreflexive, transitive, and asymmetric. The operator arranges its input in an directed acyclic graph whose edges are given by the notion of covered tuples <: (see Equation 1 above). On that structure it evaluates a structural aggregation function f, which performs an aggregation-like computation given a current tuple t and the corresponding bag of covered tuples. In other words, a variable, pseudo-recursive expression f is evaluated on a recursion tree predetermined by <.

Let expression e produce a relation {τ}_(b) for some tuple type τ; let < be a comparator for τ elements providing a strict partial ordering of e's tuples, x a new attribute name, and f a structural aggregation function τ×{τo[x:M]}_(b)→

, for some scalar type

. The unary structural grouping operator {circumflex over (Γ)} associated with <, x, and f is defined as

f_(x) ^(<):f(e):={t[x:rec_(x:f) ^(<)(e,t)]|tϵe}_(b), where

rec_(x) ^(<):f(e,t):=f(t,{μo[x: rec_(x) ^(<):f(e ,u)]1u E e[_(<:)t }) _(b)).

One can reuse the symbol r of common unary grouping for Both are similar in that they form groups of the input tuples, but does not “fold away” the tuples. Instead, it extends each tuple t in e by a new attribute x and assigns it the result of “rec”, which applies f to t and the bag of its covered tuples u. The twist is that each tuple u in the bag already carries the x value, which has in turn been computed by applying rec to u, in a recursive fashion. Thus, while f itself is not recursive, a structurally recursive computation is encapsulated in definition. The recursion is guaranteed to terminate, since <is a strict partial order.

For hierarchical windows, one can define <as above in terms of H.is- descendant, which is indeed irreflexive, transitive, and asymmetric. One can now translate the two statements II-c and III above into plans based on r x f (Inpl), f (t, X) =t. Value +E_(uEx) u. x II-c

I′ _(x) f (Inp2), f (t, X) =t. Value +E_(uEx) u. Weight * u. x III

FIG. 5 shows definitions off corresponding to the SQL expressions of FIG. 4. As the examples attest, RECURSIVE expressions translate almost literally into suitable f(t, X) formulas.

Urnary Versus Binary Grouping. Theoretically, there are little restrictions on the function f of {circumflex over (Γ)} and

; the practical limit is what SQL's expression language allows one to write. It is, however, useful to distinguish a class of common “simple” functions that can establish a correspondence between {circumflex over (Γ)} (e) and binary self- grouping e

e. An aggregation function {Γ}b→

for use with

is simple if it is of the form

${{ac{c_{\oplus {;g}}(X)}\text{:}} = {\underset{u:{u \in X}}{\oplus}{g(u)}}},$

where function gτ→

extracts or computes a value from each tuple, and ⊕ is a commutative, associative operator to combine the

values. This largely corresponds to what SQL allows for expressing in the form AGG(expr) where AGG is a basic aggregate function such as SUM, MIN, MAX, EVERY, or ANY without DISTINCT set quantifier. (A further extension to arbitrary FILTER (WHERE) conditions is possible.)

One can define a structural counterpart as follows: A structural aggregation function τ×{τo[x:N]}_b→N for use with r is simple if it is of the form

${{str} - {ac{c_{{x: \oplus};g}\left( {t,X} \right)}\text{:}}} = {{g(t)} \oplus {\underset{u \in X}{\oplus}{u.x.}}}$

In FIG. 5, functions 1b, 2b, 6b, and 7b are in fact simple.

To obtain the correspondence, consider R:=r_(x)<._(str -acc)(e) If the acyclic digraph imposed by < on e is a tree—i.e., there are no undirected cycles—the following holds for all t E R:

${t.x.} = {{{g(t)} \oplus {\underset{u \in {R{\lbrack{< :^{t}}\rbrack}}}{\oplus}{u.x.}}} = {{{g(t)} \oplus {\underset{{u \in {e{\lbrack <^{t}\rbrack}}}\ }{\oplus}{g(u)}}} = {\underset{\ {u \in {e{\lbrack \leq^{t}\rbrack}}}}{\oplus}{g(u)}}}}$

where μ≤t:⇔μ<tVμ=t. The simple form of the aggregation function allows one to “hide” the recursion through the <predicate and obtain a closed form of the expression for t.x based on the original input e. One can thus state the following correspondence:

e

_(x) ^(≤):acc_(⊕;g)e=

_(x) ^(<):str-acc_(x:⊕;g)  (e)

Note that this equivalence will not hold if there are multiple chains u <: . . . <: t connecting two tuples μ<t in the input e. In this situation, Γ would indirectly count u multiple times into t's result, while

would not. This is due to the particular semantics of structural recursion, which simply propagates x values along the <: chains. When Γ is applied in the hierarchical window setting, the equivalence holds as <: is derived from the acyclic tree structure of H, if it is additionally made sure there are no duplicate v values in the current window partition. The correspondence is then useful in both directions and enables significant optimizations: As many typical non-recursive hierarchical window computations (and sometimes even join-group-aggregate queries) fit the form of acc, one can rewrite their initial translation e

e into {circumflex over (Γ)}(e). As assessed elsewhere herein, even when e is just a table scan, the current {circumflex over (Γ)} algorithms outperform due to their simpler logic (e need not be evaluated twice) and effective pipelining. Vice versa, if one can algebraically transform a given RECURSIVE expression into the form of str-acc,

is an alternative to If a WHERE condition ϕ on the output or a FILTER condition Ψ is applied will usually be superior to as already noted above. Finally, the current manual rewrite of Stmt. I-a to I-b, where one join is saved, demonstrates an advanced optimization from into F: By e2 “merging” the two inputs into ei2, one could (without going into details) rewrite to e_(l) ¹² and then F(e12), which pays off if ei2 can be further simplified, e. g., when ei and e2 were very similar in the first place.

₄ and-

Efficient algorithms for are now described.

A general approach for

is to treat θ as an opaque join predicate with partial order properties, and stick to a generic sort-based join-group-aggregate technique: sort both inputs e₁ and e₂ according to θ, then use a sort-based left outer join e₁[t]

_(θ)e₂[μ], and then sort-based unary grouping to compute the result. This requires a non-equi join operator that deals correctly with the fact that some tuples may be incomparable through θ, and retains the order of e₁. Since no further assumptions are made on e₁ and e₂, a basic nested loops join can be used, making the runtime complexity an unattractive

(|e₁|·|e₂|). An index-based nested loops join could not be used since there generally is no index on the given inputs—only the hierarchical base table HT is indexed. This approach can be referred to by “Z,53 -Γ”. It is usually the only option when an encoding such as PPPL from above is hand- implemented in an RDBMS without further engine support.

[hierarchy-

−Γ] When

and {circumflex over (Γ)} are used for hierarchical computations and θ and < operate on NODE fields, the underlying hierarchy index H can and should be leveraged. A big improvement over

−Γ is to use a hierarchy merge join, a sort-based structural join operator with a time and space complexity of

(|e₁|+|e₂|+|e₁

e₂|). A hierarchy merge join algorithm can be provided that consumes preorder inputs,joins on the descendant axis, and retains the order of either e₁ or e₂ in the output: It can be considered the state of the art and a natural baseline for the native {circumflex over (Γ)} and algorithms. Note that even though more sophisticated join techniques have been studied in the XML, world, most are not applicable to the current setting which is working on arbitrary inputs rather than the base table HT.

[hierarchy- {circumflex over (Γ)}F , hierarchy-

]While the mentioned approaches can keep implementation efforts low by reusing existing operators, they cannot evaluate the structural recursion of {circumflex over (Γ)}, and they suffer from the efficiency issues noted above: all <join pairs rather than just the <: pairs are materialized and processed during query evaluation, and results from covered tuples are not reused. Provided herein are four specialized operators: hierarchy- {circumflex over (Γ)} and hierarchy-

, each in a top-down and a bottom-up variant. The top-down variants require the inputs to be sorted in preorder, the bottom-up variants in postorder; this order is retained in the output. Their pseudo code is presented in the following. For ease of presentation, concepts from relational algebra level are directly used: An abstract data type Aggregate represents a tuple bag X and supports self-explanatory operations clear( ) add(μ), and merge(X′). During execution of e₁ hierarchy-

e₂ or hierarchy- {circumflex over (Γ)}(e₁), one can create one Aggregate instance Xper tuple tϵe₁, assemble the appropriate input tuples in it and feed it into the aggregation function f(X) or f(t, X) to obtain t.x. In the actual query-specific implementation of an Aggregate and its operations, significant optimizations may be possible depending on f.

Unary Hierarchical Grouping. Alg. 1 shows the two variants of hierarchy- {circumflex over (Γ)}.

Algorithm 1: hierarchy-{circumflex over (Γ)}_(x : f) ^(v) (e) Input: e: {τ}_(b), where τ has a v: Node^(H) field; e ordered by v in post-/preorder (bottom up/top down) Output: {τ′}_(b), where τ′ := τ ∘ [x: N]; same order  1 S: Stack 

 [v: Node^(H), u: τ′, X: Aggregate 

 τ′ 

 ] 

 2 X: Aggregate 

 τ′ 

 3 for t ∈ e  4 if S ≠  

 

 ∧ S.top( ).v = t.v  5 skip // reuse previous X  6 else  7 X.clear( )  8

 collect input 

 *  9 yield t′ ← t ∘ [x : f(t, X)] 10 S.push([t.v, t′, X]) * 

 collect input 

 - bottom up: 11 while S ≠ 

 

 ∧ ¬H.is-before-pre(S.top( ).v, t.v) 12 [•, u, X_(u)] ← S.pop( ) 13 X.add(u) // leverage X_(u) if possible! * 

 collect input 

 - top down: 14 while S ≠ 

 

 ∧ H.is-before-post(S.top( ).v, t.v) 15 S.pop( ) 16 if S ≠ 

 

17 for [v, u, X_(u)] ∈ upper part of S where v = S.top( ).v 18 X.add(u) // leverage X_(u) if possible!

In a single pass through the input e, they effectively issue the following call sequence for each tuple t:

X.clear( ); X.add(μ) for each μ<:t; yield t0 [x: f(t, X)]where “yield” outputs a result tuple. The stack S (line 1) manages previously processed tuples u and their computation states, i.e., u.x and the corresponding aggregate X for potential reuse. For each tϵe(1.3) . The algorithm can first check whether t.v matches the previous node; in this case, the algorithm can reuse X as is. (This step can be omitted if v is known to be duplicate-free). Otherwise, the “collect input” block (1.8) maintains S and collects the tuples X covered by t. The algorithm can then compute f(t, X), construct and yield an output tuple and put it on S together with X for later reuse.

Regarding “collect input”, consider first the bottom-up case (postorder input): Previously processed tuples on S, if any, are postorder predecessors and as such on the descendant and preceding axes relative to t.v, in that order when viewed from the top of stack (whereas upcoming e tuples will be on the ancestor or following axes). Therefore, the covered tuples X required for t are conveniently placed on the upper part of S. The while loop (1. 11) collects and removes them, as they will no longer be needed. Any remaining S entries are preceding and irrelevant to t, but might be consumed later. In the top-down case (preorder input), S may, when viewed from the top, contain obsolete preceding tuples, then relevant covered ancestor tuples to add to X, then further non-immediate ancestors which may still be needed in a future iteration. The while loop (1. 14) first dismisses the preceding tuples. If there is an entry left on top of S (1. 16), it is a covered ancestor μ<: t, and the for loop (1. 17) collects it and further tuples below with equal v (if not distinct in e). Due to the tree-structured data flow, there cannot be any further covered tuples. Unlike in the bottom-up case, the algorithm cannot pop the covered entries, since they may still be needed for upcoming following tuples (e.g., a sibling of v).

Note that explicit checks are not needed for <: in this algorithm—the covered tuples are identified implicitly. Note also that in 1. 13 and 18, the full X_(u) state corresponding to u.x is available to the add( )operation. This state may be needed for non-trivial computations where u.x alone does not provide enough information. In case it is not needed, one need not keep X on S at all. Likewise, one may include on S only the fields of u that are actually accessed by f to minimize memory consumption.

Binary Hierarchical Grouping. Alg. 2 shows hierarchy-

.

Algorithm 2: e₁ hierarchy- 

 _(x : f) ^(v1;v2) e₂ Input: e₁ : {τ₁}_(b), and e₂ : {τ₂}_(b), where τ_(i) has a v_(i): Node^(H) field e_(i) ordered by v_(i) in post-/preorder (bottom up  /top down) Output: {τ1 ∘ [x: N]}_(b), same order as e₁  1 p: int, initially p ← 0 // position in e₂ (iterator)  2 S₁: Stack 

 [v: Node^(H) , X: Aggregate 

 τ₂ 

 , i : int] 

 3 S₂: Stack 

 τ₂ 

 4 X: Aggregate 

 τ₂ 

 5 for t₁ ∈ e₁  6 if S₁ ≠ 

 

 ∧ S₁.top( ).v = t₁.v₁  7 [•,X,•] ← S₁.top( )  8 yield t₁ ∘ [x: f(X)]  9 continue 10 X.clear( ) 11

 collect input 

 * 12 yield t₁ ∘ [x: f(X)] 13 S₁.push([t₁.v₁.,X,|S₂|]) * 

 collect input 

 - bottom up: 14 while S₁ ≠ 

 

 ∧ ¬H.is-before-pre(S₁.top( ).v, t₁.v₁) 15 [•,X′,•] ← S₁.pop( ) 16 X.merge(X′) 17 while S₂ ≠ 

 

18 t₂ ← S₂.top( ) 19 if ¬(t₁.v₁ = t₂.v₂ ∨ H.is-before-pre(t₁.v₁, t₂.v₂)) 20 break 21 S₂.pop( ) 22 X.add(t₂) 23 while p ≠ e₂.size( ) 24 t₂ ← e_(2.)[p] 25 if H.is-before-post(t₁.v₁, t₂.v₂) 26 break 27 if t₁.v₁ = t₂.v₂ ∨ H.is-before-pre(t₁.v₁, t₂.v₂) 28 X.add(t₂) 29 else 30 S₂.push(t₂) 31 p ← p + 1 * 

 collect input 

 - top down: 32 while S₁ ≠ 

 

 ∧ H.is-before-post(S₁.top( ).v, t₁.v₁) 33 S₁.pop( ) 34 j ← 0 35 if S₁ ≠ 

 

36 [•,X′,j] ← S₁.top( ) 37 X.merge(X′) 38 while j ≠ S₂.size( ) ∧ H.is-before-post(t₁.v₁, S₂[j].v₂) 39 X.add(S₂[j]) 40 j ← j + 1 41 pop S₂[j],...,S₂.top( ) 42 while p ≠ e₂.size( ) 43 t₂ ← e₂[p] 44 if H.is-before-pre(t₁.v₁, t₂.v₂) 45 break 46 If t₁.v₁ = t₂.v₂ ∨ H.is-before-post(t₁.v₁, t₂.v₂) 47 X.add(t₂) 48 S₂.push(t₂) 49 p ← p + 1

The bottom-up variant (postorder inputs) joins on θ=is-descendant-or-self, the top-down variant (preorder inputs) on θ=is-ancestor-or-self, with left outer join semantics. Other axes (child/parent and the non-“self” variants) as well as inner joins could be handled with minor adaptions. Both inputs are sequentially accessed: The outer loop (1. 5) passes through e₁, whereas e₂ is accessed via an iteratorp. S₂ stashes processed e₂ tuples that may still become relevant as join partners. Si collects processed nodes v₁ from e₁ with the corresponding aggregates X of θ-matched e₂ tuples for reuse. i refers to an S₂ position and is needed in the top-down case.

For each t₁ ϵe₁ (1.5) one can again either reuse Xfrom a previous equal node (1. 6-9) or assemble Xvia “collect input”, before producing an output tuple and memoizing X on S₁. inputs), “collect input” first (1. 14) removes all covered descendant entries from Si and merges their aggregates into X This operation is the key to effectively reusing partial results as motivated above. The following loop (1. 17) moves relevant θ matches on the descendant-or-self axis from S₂ to X, and the final loop (1. 23) advances the right input e₂ up to the first postorder successor of v₁. Any encountered t₂ is either a postorder predecessor or V₂=v₁; if t₂ is also a preorder successor, it is a descendant. θ matches are added straight to X(1. 28), preceding tuples are stashed on S₂ (1. 30).

The top-down case (preorder inputs) is more involved: S₁ and S₂ entries may be consumed multiple times and therefore cannot be immediately popped from the stacks. S₁ and S₂ are maintained in such way that they comprise the full chain of ancestor tuples from e₁ and e₂ relative to v₁. Field i on S₁ establishes the relationship to S₂: For an S₁ entry [v, X, i], the bag X incorporates all θ matches for v, corresponding to the S₂ range [0, i[ (i. e., from the bottom to position i, exclusively). If there is another S₁ entry [v′,X′,i′] below, then is the covered ancestor of v, and X consists exactly of X′ plus the S₂ tuples at positions [i′,i[. Maintaining these invariants requires four steps: First (1. 32), one can pop obsolete preceding entries from S₁. Second (1. 35), any remaining entry on S₁ is an ancestor, so one can reuse its X′. Third (1. 38), one can add to X any additional ancestors t₂ that were not already in X′ (starting from position j). Then, the remaining S₂ tuples from positions j to top are preceding and therefore obsolete (1. 41). Finally (1. 42), one can advance e₂ up to the first preorder successor of v₁, adding ancestor-or-self tuples to X and S₂ but ignoring preceding tuples.

Recall from above that hierarchy- {circumflex over (Γ)} is used for RECURSIVE expressions on hierarchical windows and hierarchy-

for non-recursive expressions (through self-grouping e

e) as well as certain classes of join-group-aggregate statements. Handling the details of hierarchical windows—i.e., different variants of frame and EXCLUDE clauses—requires further additions to Alg. 1 and 2; in particular, tuples with equal v values must be identified and handled as a group.

Inline Computations. The following optimization is crucial to the practical performance of

and {circumflex over (Γ)}: While the pseudo code of Alg. 1 and 2 explicitly collects tuples into some bag X, one can often avoid this buffering altogether by evaluatingfon the fly. To this end the query compiler has to generate specific code in place for the Aggregate operations:

-   -   {circle around (1)} X.clear( ), {circle around (2)} X.add(μ),         {circle around (3)} X.merge(X′), {circle around (4)} f(t,X).

Consider Expr. 1b from FIG. 5: The actual state of X would be a partial sum x:

, and the operations boil down to {circle around (1)}x←0, {circle around (2)}x←x+μ.x, {circle around (3)}x←x+X′x, and {circle around (4)} x+t.x.

This works with both {circumflex over (Γ)} and

.

As a structurally recursive example with {circumflex over (Γ)} and

, consider the Expr. 4c: here the state remains the same but {circle around (2)} becomesx←x+μ. Weight *μ.x

Eliminating X like this works whenever either the scalar x value itself or some other data of

(1)-bounded size can adequately represent the required information of a sub-computation. This roughly corresponds to the classes of distributive (e. g. COUNT, MIN, MAX, and SUM) and algebraic aggregation functions (e. g. AVG, standard deviation, and “k largest/smallest”). But then there are SQL expressions, such as ARRAY_AGG or DISTINCT aggregates, for which one can have to actually maintain X or some state of size 0(|X|). Consider COUNT(DISTINCT Weight): To evaluate this using either {circumflex over (Γ)} or

the Aggregate has to maintain a set of distinct Weight values. Still, the current mechanism for reusing sub-computations provides certain optimization opportunities; e. g., using an efficient set union algorithm for operation {circle around (3)}.

Complexities. With this in mind, consider the runtime and space complexities. One can assume the is-before primitives to be in

(1) for most static indexes and in

(log |HT|) for common dynamic indexes, |HT| being the hierarchy size;

either way, they are not affected by the input sizes of {circumflex over (Γ)} and

. Furthermore, if the computation is done inline as discussed, |X| and all operations on X are actually in

(1). Under this assumption, the time and space complexity is

(|e|) for hierarchy-{circumflex over (Γ)} and

(|e₁|+|e₂|) for hierarchy-

. If the computation can not be inlined, one can fall back to actually collecting the respective input tuples in the X bags; this means the current algorithms degenerate to plain hierarchy merge join algorithms and their time and space complexities become

(|e₁|+|e₂|+|e¹

e₂|). To obtain these results, an amortized analysis is needed to argue that the inner loops of the algorithms do not contribute to the overall complexity: Regarding hierarchy- {circumflex over (Γ)}, observe that the outer for loop pushes each e tuple once onto S (so |S|≤|e|), whereas the inner while loops remove one S entry per iteration; their bodies can thus be amortized to the respective pushes.

Regarding hierarchy-

, the loop bodies of 1. 23 and 1. 42 are executed |e₂| times in total, regardless of the outer loop; at most |e₁| and |e₂| are pushed onto S₁ and S₂, respectively; and since the other loops pop either an S₁ or S₂ entry within each iteration, a similar argument applies.

Evaluation. The algorithms above by design fit into an execution model which features a push-based physical algebra—by simply leaving out the outer for loops. Modern engines such are able to translate these algebra expressions into efficient machine code with no visible operator boundaries within pipelines; thus, there is minimal friction loss through the algebra, and one has effective pipelining.

For the hierarchy table HT, the schema from FIG. 1 was used, where each tuple has a unique CHAR(8) ID and a TINYINT Weight randomly drawn from the small domain [1,100]. The table size IHTl was varied from 10³ to 10⁶ to also cover loads that by far exceed L3 cache capacity: at 10⁶, HT and its index use≈218 MB. For the hierarchy index one can compare two alternatives: [static] refers to the simple PPPL labeling scheme from above, which does not support updates but is extremely fast and thus attractive for read-mostly analytic scenarios. [dynamic] refers to the BO-tree indexing scheme, where each Node is linked to two entries in a dynamic B+-tree structure. The suggested configuration with mixed block sizes and gap back-links was used. It is a good fit for dynamic OLTP scenarios, although the support for updates comes at a cost of computationally non-trivial

(log |HT|) query primitives and increased memory traffic. Other dynamic indexing schemes will of course show different characteristics; still, comparing dynamic vs. static gives one a good hint of the overhead to expect from accessing an external, dynamic index structure. All experiments use a generated forest structure Regular

k

where each tree is given m=10⁴ nodes and each inner node exactly k children. This way increasing |HT| does not affect the total height h. To assess the influence of the hierarchy shape, very deep (k=2, h≈13.2) trees to very shallow (k=32, h≈3.6) trees were compared.

Hierarchical Windows. To assess the bare performance of hierarchical windows, Stmt. IV can be run with various expressions from diagram 400 of FIG. 4 on a pre-materialized table Inp. Queries Q1 and Q2 compute Expr. 1a bottom up and top down, respectively and represent non-recursive computations. Q3 computes Expr. (4c) and represents a structurally recursive computation. Q4 computes COUNT(DISTINCT Weight) bottom up and features a comparatively expensive duplicate elimination. For each query one can measure alternative plans. All plans work on the same input Inp, which is prepared a priori as follows: One can select the contents of HT (thus, |Inp|=|HT|), add a randomly populated INT Value field, project the required fields and sort the data in either preorder or postorder as needed by the respective plan. The measurements thus show the bare performance of the respective operators without any pre- or post- processing—in particular, without sorting—but including materialization of the query result. One can compare the following plans, where applicable: (a) the straight translation into hierarchy- {circumflex over (Γ)}(Inp); (b) the alternative hierarchy-

(Inp, Inp), to assess the overhead over hierarchy- {circumflex over (Γ)}; (c) the hierarchy-

-Γ approach above with a preorder-based hierarchy merge join; (d) the

-Γ approach with a nested loops join. As explained above, (c) is a natural baseline, whereas (d) will often be the only option with hand-implemented encodings. One can furthermore consider two plans based on a semi-naive least-fixpoint operator, which mimic SQL's recursive CTEs: (e) iterative uses repeated IS_CHILD hierarchy merge joins to first compute all <pairs bottom up (Q1) or top down (Q2) and then performs the actual computation using sort-based grouping. (f) iterative* additionally applies sort-based “early grouping” within each iteration. This gives one a hint of the performance to expect from an exceptionally well-optimized RCTE or from a hand-crafted iterative stored procedure. One can commonly see such procedures in real- world applications that still rely on trivial parent/child tables (known as adjacency list model). However, (e) and (f) are no general solutions; they work in the setup only because all HT nodes are present in Inp. Note also that plans (b)(f) work only for non-recursive computations.

FIG. 6 is a diagram 600 that shows the results, normalized with respect to the processed elements The red line indicates the speed of tuple-by-tuple copying a precomputed result table as the physical upper bound (≈37.6 M/s). In Q1-3 with static, {circumflex over (Γ)} is remarkably close to this bound (≈25.4 M/s, or 67%). That non-recursive computations (Q1) using {circumflex over (Γ)} are not slower than recursive ones (Q3) comes at no surprise since the algorithm is identical. For both {circumflex over (Γ)} and

, the top-down algorithms (Q2) are slightly slower than the bottom-up algorithms (Q1), as they cannot dismiss covered tuples as early and thus inherently issue more index calls. The duplicate elimination of Q4 is costly—both {circumflex over (Γ)}

and become roughly 3× to 4× slower over the trivial arithmetics of Q1-3. When comparing e

e to {circumflex over (Γ)}(e) over all queries Q1-4, one can see the latter is on average around 32% faster. The overhead of binary grouping stems from evaluating e twice (which in this case is a table scan) and from the extra index calls needed to associate ei and e2 tuples. hierarchy-

-Γ is significantly slower than, mostly in bottom-up Q1 (e. g. ≈11×slower at k=2) but also in top-down Q2 (≈3.5× at k=2); the gap grows with the hierarchy height. This confirms the known “groupjoin advantage” also for the hierarchical casein line with the reports on hash-based equi-groupjoins. hierarchy-

-Γ is somewhat handicapped at Q1, as the hierarchy merge join algorithm that can be used is preorder-based; as preorder is more natural to top-down computations, hierarchy-

-Γ performs noticeably better at Q2. Interestingly, hierarchy-

-Γ is not slowed down as much at Q4 vs. Q1 as the others; apparently, the intermediate join dominates the costs so that the subsequent processing-friendly sort-based grouping does not matter much. Correspondingly, the overhead over

is smaller at Q4, though still noticeable.

The iterative solutions are generally slow. Early aggregation helps much in the bottom-up case, where iterative* even approaches hierarchy-

-Γ at |HT|=10⁶. In the top-down case, however, early aggregation does not help reduce the intermediate result sizes, as IS_PARENT is an N: 1 join; here, the (minor) savings over iterative come from saved arithmetic operations by reusing results of previous iterations.

Regarding dynamic versus static indexes, the more complex axis checks of the former are clearly noticeable; especially in top-down Q2, where inherently more axis checks are issued. Note the BO-tree is freshly bulkloaded; in practice the performance of most dynamic indexes tends to further degrade from incremental updates.

If one considers the hierarchy shapedeep k=2 versus flat k=32one can see that iterative and iterative* are very sensitiveunsurprisingly, as their time complexity is proportional to h—whereas and m⁻ are practically indifferent. The intermediate join result of hierarchy- is somewhat proportional to h, so it is also affected to some extent (factor 2-3).

Increasing the hierarchy size 1HT1 should slow down dynamic due to the

(log |HT|) complexity of the index primitives. However, for the chosen block-based BO-tree index this apparently does not matter much in practice: the figures are practically indifferent to |HT|. One reason for this is the favourable data locality in the ordered inputs: the nodes involved in is-before checks are usually close in terms of pre/post distance, therefore the relevant BO-tree blocks will be in cache. hierarchy-

-Γ and iterative are much more sensitive to |HT| due to their growing intermediate results.

Note that the above experiments assess only e₁

e₂ where e₁=e₂, i.e., a unary hierarchical window setup. One can also conducted measurements where e₁ ≠e₂ with varying |e₁| and |e₂| sizes. However, the result was found to be completely in line with the complexity

(|e₁|+|e₂|+|e₁

e₂|) of

.

Sorting. Being order-based, hierarchy- {circumflex over (Γ)} and hierarchy-

require pre- or post-ordered inputs. It is up to the cost-based optimizer to provide them by employing (a) explicit Sort operations via is-before; (b) ordered hierarchy index scans on the base table HT to establish the order in the first place; (c) order-preserving operators such as hierarchy merge join and the {circumflex over (Γ)}/

to retain the order once establishedConsider running Expr. 2b from FIG. 4 directly on HT. In the bottom-up case, one can compare e₁ ={circumflex over (Γ)}(HT_(post)) on an already post-ordered copy of HT, just like in Q1; e₂={circumflex over (Γ)} (Sort_(post)(HT)), a full sort; e₃={circumflex over (Γ)} (IndexScan_(post)(HT)), which accesses HT through a hierarchy index scan; and e₄={circumflex over (Γ)}(Rearrange_(post)(HT_(pre))); mutatis mutandis in the top-down case. The Rearrange operator consumes an already pre-ordered HT copy and employs a stack-based structural sorting algorithm similar to {circumflex over (Γ)}; its advantage is that it allows limited pipelining.

From the results in diagram 600 of FIG. 6, one can observe that full sorting is less expensive than one may expect (roughly 3× slower with static), considering that the algorithm is not multithreaded. Leveraging an index scan also helps much. But most interestingly, the “order-based sorting” of Rearrange is greatly superior to a full Sort, especially in the bottom-up static case: Rearrange closely approaches the “perfect” speed of e_(o)! This is again explained by pipelining effects and the favorable data locality in the already preordered inputs. This means the bottom-up algorithms are not restricted to postorder; they could be applied to preorder inputs as well at only moderate extra costs. To a slightly lesser extent this also applies to the preorder-based top-down algorithms.

Report Query. Having assessed hierarchical windows in isolation, one can next look at a complete query, Q7. To emulate the setting of Stmt. I-a from above, one can use |HT|=10 ₄ and k=8, and prepare a table Inp with only a subset of the hierarchy HT, namely p% of its 8751 leaf nodes (randomly chosen). At the heart, Q5 performs a bottom-up rollup as Q1, but additionally (a) needs a join/union with the relevant output nodes of HT, (b) computes the contribution in % of each node's X value to the parent's total, (c) carries 128 bytes of further payload through the computation, (d) outputs only the 3 upper levels (584 nodes), ordered in preorder, and visualizes the nodes' positions to the user by Dewey-style path strings. Such additional “stress factors” are commonly found in real-world queries. An example result line may be [′/A1/B1/C2′, 125, 10%, payload], if the X value of′/A1/B1′ is 1250. In SQL:

WITH T1 (Node, ID, Payload, X) AS ( SELECT HT.Node, HT.ID, HT.Payload, SUM(Inp.Value) OVER (HIERARCHIZE BY HT.Node) FROM HT LEFT OUTER JOIN Inp ON HT.Node = Inp.Node ). T2 (Node, ID, Payload, X, Contrib, Path) AS ( SELECT Node, ID, Payload, X, RECURSIVE ( 100.00 * X / FIRST_VALUE(X) OVER w ). RECURSIVE VARCHAR(255) ( COALESCE(FIRST_VALUE(P) OVER w, ‘ ’) || ‘/’ || ID) AS P. FROM T1 WINDOW w AS (HIERARCHIZE BY Node TOP DOWN) ) SELECT Path, X, Contrib, Payload FROM T2 WHERE LEVEL(Node) <= 3 -- ϕ ORDER BY PRE_RANK(Node)

One can measure the following hand-optimized plans:

a. {circumflex over (Γ)}(Rearrange_(pre)(σ_(ϕ)({circumflex over (Γ)}_(X)(Sort_(post)(HT_(ϕ)) ∪ Sort_(post)(Inp))))) b. {circumflex over (Γ)}(Rearrange_(pre)(Sort_(post)(HT_(ϕ)) 

 _(X)Sort_(post)(Inp))) c. Map( 

 ( 

 Γ_(X)(Sort_(pre)(HT_(ϕ)) 

 Sort_(pre)(Inp))))) d. Sort(Map( 

 ( 

 (Γ_(X)(HT_(ϕ)) 

 Inp))))) e. Iterative_(ϕ)(HT, Inp)

In all plans, σ_(ϕ) has been pushed down and is handled by an ordered index scan of HT. Plans a and b use the {circumflex over (Γ)} and operators. The outer {circumflex over (Γ)} handles both top-down computations and preserves the desired preorder. For Plan c one can assume the hierarchical table model without the enhancements: It relies only on hierarchy merge joins, i. e., the hierarchy-

-Γ approach. Lacking the syntax extensions, a lot of manual “SQL labour” is involved: The upper 3 levels must be joined via two IS_PARENT joins and the path strings built by hand (the two outer

and Map operators in c/d). For Plan d one can assume a hand-implemented static PPPL-like labeling scheme. Lacking engine support, it can use only nested loops joins, i. e., the

-Γ approach. For Plan e, one can assume again the adjacency list model and a hand-written stored procedure which does an iterative fixpoint computation (like iterative in Q1/Q2). Although Plans de are severely handicapped versus a-c, they are representative of the state of the art in real-world applications.

FIG. 6 shows the measured query throughput over varying p. The biggest pain point in this query is the expensive sorting of Inp, which could be alleviated through parallel sorting. Nevertheless, one can still see the merits of the proposed syntax and algorithms: Both Γ and

reasonably handle the query, but the latter more naturally fits its binary nature. Their advantage over plain hierarchy-

-Γ (c) is still visible, but less pronounced due to the damping effect of the sorting. It is not surprising that Plans c, d, and e, besides being unwieldy hand-crafted solutions, cannot hold up in terms of expressiveness and efficiency. Q7 is just one example query typically found in the application scenarios.

Expressing Hierarchical Computations. While some query languages such as MDX or XML/XQuery offer native support for hierarchical data and certain computations, the goal is to remain in the world of SQL. Prior to the hierarchical tables, a uniform data model and language for handling hierarchies in RDBMS was lacking. Earlier solutions are therefore usually hard-wired to particular relational encodings, which largely dictate the computations that can be expressed: On the low end is the trivial adjacency list model based on foreign key references to parent nodes, where recursion (see below) is required even for simple tasks. More sophisticated path- or containment-based encodings alleviate many tasks by allowing one to replace recursion by hierarchy joins, but computations are then limited to what joingroupaggregate statements can do. Another common “scheme” is the leveled model, where a denormalized table encodes a hierarchy with a fixed number of homogenous levels. Targeting this model in particular, SQL has a ROLLUP construct for simple sums, counts, and the like, but this is merely syntactic sugar for GROUPING SETS and again of limited expressiveness. The hierarchical table model relieves the user from dealing with the complexities and limitations of a hand-implemented encoding. Its abstract nature ensures that the provided constructs work with a multitude of indexing schemes on the query/update performance spectrum. Moreover, its main concept of a NODE field encapsulating the hierarchy provides attractive syntax opportunities which was explored above.

Recursion in SQL. The only two common RDBMS-level mechanisms for working with recursively structured data are RCTEs and (iterative or recursive) stored procedures. These mechanisms afford generative recursion and are thus more powerful than the structural recursion of the RECURSIVE expressions. But their power and generality also makes them difficult to handle and optimize. With the optimization of linearly recursive CTEs with GROUP BY, directed graphs can be considered, whereas the focus is specifically on tree structures. Unsurprisingly, the specialized algorithms easily outperform techniques for RCTEs. Also, the simple nature of structural recursionwhere the recursion tree is predeterminedleaves more room for optimizations, as provided above. Aside from performance, one may ask whether RCTEs are at least “sufficient” in terms of expressiveness, i. e.: Can RCTE-based recursion with GROUP BY emulate structural grouping? Alas, all the attempts to phrase such a computation in an iterative way—starting at the <-minimal tuples, then sweeping breadth-first over the input via <:-led to very convoluted EXISTS subqueries. Also, GROUP BY is forbidden in an RCTE definition to enable the semi-naive fix-point evaluation. Even if GROUP BY could be used, it would not necessarily capture all relevant covered nodes within each iteration. Thus, for the use cases, the computational power of RCTEs is only of theoretical relevance.

Evaluating Aggregation Queries. Evaluating GROUP BY can be done using either sort-based or hash-based methods. Like sort-based grouping, the operators require ordered inputs and are order-preserving. Group-join improves joingroup aggregate plans by fusing

and Γ. Consider the non-equi case, which is more comparable to the hierarchy-

setting. Regarding ROLLUP, one approach can use a dedicated single-pass operator that reuses results of lower levels. It will be appreciated that techniques for standard windowed tables cannot easily be adapted to the hierarchical windows due to their unique semantics.

Hierarchy-aware operators. Since XML data is inherently hierarchical and often stored in relational tables, there is a significant body of work on querying native XML stores or XML-enhanced RDBMS. Structural join operators resembling self- merge-j oins leverage an available (though hard-wired) hierarchy encoding and maintain a stack of relevant intermediate results. Not all techniques from the XML world fit into the setting, however: Some of the more sophisticated join operators were designed to work directly on an indexed XML document. This enables advanced optimizations such as skipping. In contrast, the current operators are usually applied to arbitrary input tables with a NODE field (e. g., Inp I) rather than the hierarchical table (e. g., HT) itself. As indexing Inp I on the fly seems infeasible; only HT's index was relied on, which renders many of the optimizations inapplicable. While one could e. g. adapt Staircase Join for cases where the computation runs directly on HT, this would benefit only a limited number of queries. Beyond binary structural joins, powerful tree pattern matching operators (e. g., twig joins) were proposed in the XML context; but these are beyond the requirements for handling hierarchical data in RDBMS.

Expressing hierarchical computations in RDBMS has always been severely impeded by data model and language issues, and even when possible, convoluted RCTEs or procedure calls rendered an efficient evaluation very difficult. One can resolve this situation by exploiting the opportunities of the hierarchical table model in terms of expressiveness and engine support. The NODE type and SQL's windowed tables turn out to be a natural fit. Together with structural recursion, a useful class of computations can be expressed concisely and intuitively. For their evaluation an order- based, index-assisted structural grouping operators is proposed. They rely entirely on pre- and post-order primitives and thus work with a multitude of indexing schemes. The current experiments confirm their merits over conventional approaches, which result from their robust linear space and time complexities and their computational power. Altogether the novel functionality provided herein greatly simplifies and speeds up the many applications that deal with hierarchies, in business software and beyond, by allowing them to push even more logic down to the RDBMS layer.

FIG. 7 is a process flow diagram 700 in which, at 710, a query is received by a database which comprises at least one request for a table whose rows can be related to a hierarchy of nodes and specifies an aggregation operation for aggregating the data in this table according to the hierarchy of nodes. Thereafter, at 720, the table is accessed that represents the data to be aggregated hierarchically that comprises a plurality of tuples which each can be associated to at most one node of the hierarchy of nodes. Later, for each tuple, it is checked, at 730, whether the hierarchy node associated to such tuple matches a node for an previously processed tuple, such previously processed tuple having a previously calculated aggregation value. In addition, at 740, the previously calculated aggregation value is reused for each tuple if the node of such tuple matches the node for such previous processed tuple. Further, at 750, an aggregation value is generated for a tuple when the aggregation value for such tuple cannot be reused from any previously processed tuple. Subsequently, at 760, data is provided that comprises results responsive to the query based on at least a portion of the previously calculated aggregation values and at least a portion of the generated aggregation value. Provided, in this context, can include one or more of: storing at least a portion of the results in tangible data storage, loading at least a portion of the results in memory, displaying at least a portion of the results on an electronic visual display, and/or transmitting at least a portion of the results to a remote computing system.

One or more aspects or features of the subject matter described herein can be realized in digital electronic circuitry, integrated circuitry, specially designed application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) computer hardware, firmware, software, and/or combinations thereof. These various aspects or features can include implementation in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device. The programmable system or computing system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

These computer programs, which can also be referred to as programs, software, software applications, applications, components, or code, include machine instructions for a programmable processor, and can be implemented in a high-level procedural language, an object-oriented programming language, a functional programming language, a logical programming language, and/or in assembly/machine language. As used herein, the term “machine-readable medium” refers to any computer program product, apparatus and/or device, such as for example magnetic discs, optical disks, memory, and Programmable Logic Devices (PLDs), used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term “machine-readable signal” refers to any signal used to provide machine instructions and/or data to a programmable processor. The machine-readable medium can store such machine instructions non-transitorily, such as for example as would a non-transient solid-state memory or a magnetic hard drive or any equivalent storage medium. The machine-readable medium can alternatively or additionally store such machine instructions in a transient manner, such as for example as would a processor cache or other random access memory associated with one or more physical processor cores.

In the descriptions above and in the claims, phrases such as “at least one of” or “one or more of” may occur followed by a conjunctive list of elements or features. The term “and/or” may also occur in a list of two or more elements or features. Unless otherwise implicitly or explicitly contradicted by the context in which it is used, such a phrase is intended to mean any of the listed elements or features individually or any of the recited elements or features in combination with any of the other recited elements or features. For example, the phrases “at least one of A and B;” “one or more of A and B;” and “A and/or B” are each intended to mean “A alone, B alone, or A and B together.” A similar interpretation is also intended for lists including three or more items. For example, the phrases “at least one of A, B, and C;” “one or more of A, B, and C;” and “A, B, and/or C” are each intended to mean “A alone, B alone, C alone, A and B together, A and C together, B and C together, or A and B and C together.” In addition, use of the term “based on,” above and in the claims is intended to mean, “based at least in part on,” such that an unrecited feature or element is also permissible.

The subject matter described herein can be embodied in systems, apparatus, methods, and/or articles depending on the desired configuration. The implementations set forth in the foregoing description do not represent all implementations consistent with the subject matter described herein. Instead, they are merely some examples consistent with aspects related to the described subject matter. Although a few variations have been described in detail above, other modifications or additions are possible. In particular, further features and/or variations can be provided in addition to those set forth herein. For example, the implementations described above can be directed to various combinations and subcombinations of the disclosed features and/or combinations and subcombinations of several further features disclosed above. In addition, the logic flows depicted in the accompanying figures and/or described herein do not necessarily require the particular order shown, or sequential order, to achieve desirable results. Other implementations may be within the scope of the following claims. 

What is claimed is:
 1. A method for implementation by one or more data processors forming part of at least one computing device, the method comprising: receiving, by a database, a query which comprises at least one request specifying a table whose rows can be related to a hierarchy of nodes, the query specifying an aggregation operation for hierarchically aggregating the data in the specified table according to the hierarchy of nodes, the table encoding a forest of ordered, rooted, labeled trees such that one tuple represents one hierarchy node and labels of a node are fields for an associated row in the table; accessing the specified table that represents the data to be aggregated hierarchically; checking, for a tuple, whether a hierarchy node associated to such tuple matches a node for a previous processed tuple, such previous processed tuple having a previously calculated aggregation value; reusing, for a tuple, a previously calculated aggregation value if the node of such tuple matches the node for such previous processed tuple; and generating, for each tuple, an aggregation value when the aggregation value for such tuple cannot be reused from any previously processed tuple.
 2. The method of claim 1, wherein the aggregation values for the previously processed tuples are placed within a stack and the method further comprises: placing the generated aggregation values into the stack.
 3. The method of claim 2, wherein the hierarchy of nodes comprises at least one root node and a plurality of leaf nodes and the hierarchy of nodes is traversed in a direction of the leaf nodes to the at least one root node.
 4. The method of claim 3, wherein the previously calculated aggregation values are placed on top of the stack.
 5. The method of claim 4 further comprising: removing previously calculated aggregation values from the stack that are no longer needed when traversing the tuples.
 6. The method of claim 2, wherein the hierarchy of nodes comprises at least one root node and a plurality of leaf nodes and the hierarchy of nodes is traversed in a direction from the root nodes to the leaf nodes.
 7. The method of claim 6, wherein the stack, when viewed from its top, comprises obsolete aggregation values which are dismissed and passed over.
 8. The method of claim 1, wherein providing data comprises at least one of: persisting at least a portion of the results, loading at least a portion of the results into memory, transmitting at least a portion of the results to a remote computing system, or displaying at least a portion of the results in an electronic visual display.
 9. The method of claim 1, wherein the query is formulated in Structured Query Language (SQL).
 10. The method of claim 1, wherein the database is a main-memory relational database management system.
 11. The method of claim 10, wherein the database is a column-oriented in- memory database.
 12. The method of claim 1, wherein the database is a distributed database in which data is stored across multiple computing systems.
 13. The method of claim 1 further comprising: determining a hierarchical window for the query; and determining, using binary structural grouping, input nodes and output nodes within the hierarchical window.
 14. The method of claim 1 further comprising: determining a hierarchical window for the query; and evaluating recursive expressions on the hierarchical window using unary structural grouping.
 15. A system comprising: at least one data processor; and memory storing instructions which, when executed by the at least one data processor, result in operations comprising: receiving, by a database, a query that can be related to a table encapsulating a hierarchy of nodes, the query specifying an aggregation operation for hierarchically aggregating the data in the specified table according to the hierarchy of nodes, the table encoding a forest of ordered, rooted, labeled trees such that one tuple represents one hierarchy node and labels of a node are fields for an associated row in the table; accessing the specified table that represents the data to be aggregated hierarchically, the table encoding a forest of ordered, rooted, labeled trees such that one tuple represents one hierarchy node and labels of a node are fields for an associated row in the table; checking, for a tuple, whether a hierarchy node associated to such tuple matches a node for a previous processed tuple, such previous processed tuple having a previously calculated aggregation value; reusing, for a tuple, a previously calculated aggregation value if the node of such tuple matches the node for such previous processed tuple; and generating, for each tuple, an aggregation value when the aggregation value for such tuple cannot be reused from any previously processed tuple.
 16. The system of claim 15 further comprising the database.
 17. The system of claim 15, wherein the aggregation values for the previously processed tuples are placed within a stack and the operations further comprise: placing the generated aggregation values into the stack.
 18. The system of claim 17, wherein the hierarchy of nodes comprises at least one root node and a plurality of leaf nodes and the hierarchy of nodes is traversed in a direction of the leaf nodes to the at least one root node.
 19. The system of claim 18, wherein the previously calculated aggregation values are placed on top of the stack.
 20. A method for implementation by one or more data processors forming part of at least one computing device, the method comprising: receiving, by a database, a query that can be related to data in a form according to a hierarchy of nodes encapsulated in a table, the query specifying an aggregation operation for hierarchically aggregating the data in the according to the hierarchy of nodes, the table encoding a forest of ordered, rooted, labeled trees such that one tuple represents one hierarchy node and labels of a node are fields for an associated row in the table; accessing tuples of data to be aggregated hierarchically which each can be associated to at most one node of the hierarchy of nodes; checking, for a tuple, whether a hierarchy node associated to such tuple matches a node for a previous processed tuple, such previous processed tuple having a previously calculated aggregation value; reusing, for a tuple, a previously calculated aggregation value if the node of such tuple matches the node for such previous processed tuple; and generating, for each tuple, an aggregation value when the aggregation value for such tuple cannot be reused from any previously processed tuple. 